The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^3, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
add(0, X) → X
add(s(X), Y) → s(add(X, Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
terms, sqr, add, dbl, first

They will be analysed ascendingly in the following order:
sqr < terms
add < sqr
dbl < sqr

(6) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

The following defined symbols remain to be analysed:
add, terms, sqr, dbl, first

They will be analysed ascendingly in the following order:
sqr < terms
add < sqr
dbl < sqr

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)

Induction Base:
add(gen_s:0'5_0(0), gen_s:0'5_0(b)) →_R^Ω(1)
gen_s:0'5_0(b)

Induction Step:
add(gen_s:0'5_0(+(n7_0, 1)), gen_s:0'5_0(b)) →_R^Ω(1)
s(add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b))) →_IH
s(gen_s:0'5_0(+(b, c8_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

The following defined symbols remain to be analysed:
dbl, terms, sqr, first

They will be analysed ascendingly in the following order:
sqr < terms
dbl < sqr

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)

Induction Base:
dbl(gen_s:0'5_0(0)) →_R^Ω(1)
0'

Induction Step:
dbl(gen_s:0'5_0(+(n698_0, 1))) →_R^Ω(1)
s(s(dbl(gen_s:0'5_0(n698_0)))) →_IH
s(s(gen_s:0'5_0(*(2, c699_0))))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

The following defined symbols remain to be analysed:
sqr, terms, first

They will be analysed ascendingly in the following order:
sqr < terms

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)

Induction Base:
sqr(gen_s:0'5_0(0)) →_R^Ω(1)
0'

Induction Step:
sqr(gen_s:0'5_0(+(n984_0, 1))) →_R^Ω(1)
s(add(sqr(gen_s:0'5_0(n984_0)), dbl(gen_s:0'5_0(n984_0)))) →_IH
s(add(gen_s:0'5_0(*(c985_0, c985_0)), dbl(gen_s:0'5_0(n984_0)))) →_L^{Ω(1 + n984₀)}
s(add(gen_s:0'5_0(*(n984_0, n984_0)), gen_s:0'5_0(*(2, n984_0)))) →_L^{Ω(1 + n984₀2)}
s(gen_s:0'5_0(+(*(n984_0, n984_0), *(2, n984_0))))

We have rt ∈ Ω(n³) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n³).

(14) Complex Obligation (BEST)

(15) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

The following defined symbols remain to be analysed:
terms, first

(16) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol terms.

(17) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

The following defined symbols remain to be analysed:
first

(18) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
first(gen_s:0'5_0(n1851_0), gen_cons:nil4_0(n1851_0)) → gen_cons:nil4_0(n1851_0), rt ∈ Ω(1 + n1851₀)

Induction Base:
first(gen_s:0'5_0(0), gen_cons:nil4_0(0)) →_R^Ω(1)
nil

Induction Step:
first(gen_s:0'5_0(+(n1851_0, 1)), gen_cons:nil4_0(+(n1851_0, 1))) →_R^Ω(1)
cons(recip(0'), first(gen_s:0'5_0(n1851_0), gen_cons:nil4_0(n1851_0))) →_IH
cons(recip(0'), gen_cons:nil4_0(c1852_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(19) Complex Obligation (BEST)

(20) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)
first(gen_s:0'5_0(n1851_0), gen_cons:nil4_0(n1851_0)) → gen_cons:nil4_0(n1851_0), rt ∈ Ω(1 + n1851₀)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)

(22) BOUNDS(n^3, INF)

(23) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)
first(gen_s:0'5_0(n1851_0), gen_cons:nil4_0(n1851_0)) → gen_cons:nil4_0(n1851_0), rt ∈ Ω(1 + n1851₀)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

No more defined symbols left to analyse.

(24) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)

(25) BOUNDS(n^3, INF)

(26) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

No more defined symbols left to analyse.

(27) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
sqr(gen_s:0'5_0(n984_0)) → gen_s:0'5_0(*(n984_0, n984_0)), rt ∈ Ω(1 + n984₀ + n984₀² + n984₀³)

(28) BOUNDS(n^3, INF)

(29) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)
dbl(gen_s:0'5_0(n698_0)) → gen_s:0'5_0(*(2, n698_0)), rt ∈ Ω(1 + n698₀)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

No more defined symbols left to analyse.

(30) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)

(31) BOUNDS(n^1, INF)

(32) Obligation:

TRS:
Rules:
terms(N) → cons(recip(sqr(N)), terms(s(N)))
sqr(0') → 0'
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0') → 0'
dbl(s(X)) → s(s(dbl(X)))
add(0', X) → X
add(s(X), Y) → s(add(X, Y))
first(0', X) → nil
first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))

Types:
terms :: s:0' → cons:nil
cons :: recip → cons:nil → cons:nil
recip :: s:0' → recip
sqr :: s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
add :: s:0' → s:0' → s:0'
dbl :: s:0' → s:0'
first :: s:0' → cons:nil → cons:nil
nil :: cons:nil
hole_cons:nil1_0 :: cons:nil
hole_s:0'2_0 :: s:0'
hole_recip3_0 :: recip
gen_cons:nil4_0 :: Nat → cons:nil
gen_s:0'5_0 :: Nat → s:0'

Lemmas:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)

Generator Equations:
gen_cons:nil4_0(0) ⇔ nil
gen_cons:nil4_0(+(x, 1)) ⇔ cons(recip(0'), gen_cons:nil4_0(x))
gen_s:0'5_0(0) ⇔ 0'
gen_s:0'5_0(+(x, 1)) ⇔ s(gen_s:0'5_0(x))

No more defined symbols left to analyse.

(33) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
add(gen_s:0'5_0(n7_0), gen_s:0'5_0(b)) → gen_s:0'5_0(+(n7_0, b)), rt ∈ Ω(1 + n7₀)

(34) BOUNDS(n^1, INF)